A Reduced Distributed Splicing System for RE Languages
نویسندگان
چکیده
In this paper we prove that any recursively enumerable language can be generated using a distributed splicing system with a xed number of test tubes. This improves a recent result by Csuhaj-Varj u, Kari, PP aun, proving computational completeness only for a system with a number of tubes depending on the cardinality of the used alphabet.
منابع مشابه
Locally Evolving Splicing Systems
An extended H system with locally evolving rules is a model of splicing computation with a special feature that the splicing rules evolve at each step. It was originally proved by Paun et al. that all RE languages can be generated by such systems with a finite set of rules of radius at most 4 and with contexts of length at most 7 for the insertion-deletion rules by which the splicing rules evol...
متن کاملNine Test Tubes Generate any RE
In this paper we discuss how any recursively enumerable language can be generated using a distributed splicing system with a xed number of nine test tubes. This number has been recently reduced by other authors, and in this work we try to give an insightful algorithmic description of this kind of systems.
متن کاملCdmtcs Research Report Series Cooperating Distributed Splicing Systems Cooperating Distributed Splicing Systems
We introduce a new class of cooperating distributed H systems which consist of a given set of splicing systems (sets of splicing rules plus sets of axioms), similar in form to the cooperating distributed grammar systems. By applying iteratively the components of such a system (starting from a given initial string), in a sequence which runs nondeterministically, in such a way that a step is cons...
متن کاملApplication of Generalised sequential crossover of languages to generalised splicing
This paper outlines an application of iterated version of generalised sequential crossover of two languages (which in some sense, an abstraction of the crossover of chromosomes in living organisms) in studying some classes of the newly proposed generalised splicing (GS) over two languages. It is proved that, for X, Y ∈ {FIN, REG, LIN, CF, CS, RE}, Σ ∈ FIN , the subclass of generalized splicing ...
متن کاملCommunicating Distributed H systems with Simple Splicing Rules
In this paper we define communicating distributed H systems with simple splicing rules of types (1,3), (1,4) and (2,3) and study the generative capacity. keyword: Splicing systems, contextfree languages, simple H systems, test tube systems, communicating distributed H systems
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997